Supervised Template Estimation for Document Image Decoding

نویسندگان

  • Gary E. Kopec
  • Mauricio Lomelin
چکیده

Gary E. Kopec, Member, IEEE, and Mauricio Lomelin, Member, IEEE July 20, 1997 Abstract An approach to supervised training of character templates from page images and unaligned transcriptions is proposed. The template training problem is formulated as one of constrained maximum likelihood parameter estimation within the document image decoding framework. This leads to a three-phase iterative training algorithm consisting of transcription alignment, aligned template estimation (ATE) and channel estimation steps. The maximum likelihood ATE problem is shown to be NP-complete and thus an approximate solution approach is developed. An evaluation of the training procedure in a document-specific decoding task using the Univ. of Washington UW-II database of scanned technical journal articles is described.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Document image decoding approach to character template estimation

Template Estimation 1 Gary E. Kopec2 Xerox Palo Alto Research Center Mauricio Lomelin3 Microsoft Corp. November 29, 1995 Abstract This paper develops an approach to supervised training of character templates from page images and unaligned transcriptions. The template estimation problem is formulated as one of constrained maximum likelihood parameter estimation within the document image decoding...

متن کامل

Document-specific character template estimation

An approach to supervised training of document-specific character templates from sample page images and unaligned transcriptions is presented. The template estimation problem is formulated as one of constrained maximum likelihoodparameter estimation within the document image decoding (DID) framework. This leads to a two-phase iterative training algorithm consisting of transcriptionalignment and...

متن کامل

Document Image Decoding Using Iterated Complete Path Search with Subsampled Heuristic Scoring

It has been shown that the computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. In the Iterated Complete Path (ICP) method, template matches are performed only along the best path found by dynamic programming on each iteration. When the best path stabilizes, the decoding is optimal and no more templa...

متن کامل

Document image decoding using iterated complete path search

The computation time of Document Image Decoding can be significantly reduced by employing heuristics in the search for the best decoding of a text line. By using a cheap upper bound on template match scores, up to 99.9% of the potential template matches can be avoided. In the Iterated Complete Path method, template matches are performed only along the best path found by dynamic programming on e...

متن کامل

Image-based Position Estimation and Adaptive Modulation Coding in Vehicular Communication

Vehicle position estimation is a key technology for Inter-Vehicle Communications, while template matching can be used to get information of vehicular position. In the paper, a simplified template matching, namely area-based template match is considered. A vehicular communication system designed for wireless data application is proposed where a camera is fixed in a vehicle which is served as a b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Pattern Anal. Mach. Intell.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1997